Linear recognition of pseudo-split graphs
نویسندگان
چکیده
منابع مشابه
Constant-Time Parallel Recognition of Split Graphs
We show that the class of perfect graphs known as split graphs can be efficiently recognized in a parallel process environment. Given an undirected graph G = (V, E) with n vertices we define a subgraph G, = (AV, AE) and we prove some properties on G, leading to a constant-time parallel split graph recognition algorithm.
متن کاملRecognition of unipolar and generalised split graphs
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique number, the stability number, the chromatic number, and to solve other problems that are hard for general graphs. We present an O(n)-time algorithm for ...
متن کاملA Simple Linear Time Split Decomposition Algorithm of Undirected Graphs
We revisit the problem of designing a linear time algorithm for undirected graph split decomposition. Although that this problem has already been claimed to be solved in [E. Dahlhaus, FSTTCS, 1994] and [E. Dahlhaus, Journal of Algorithms 36(2):205-240, 2000], we present a new well founded theoretical background for split decomposition that allow us to clearly design and proove the rst simple li...
متن کاملLinear Recognition of Almost Interval Graphs
Give a graph class G and a nonnegative integer k, we use G+kv, G+ke, and G−ke to denote the classes of graphs that can be obtained from some graph in G by adding k vertices, adding k edges, and deleting k edges, respectively. They are called almost (unit) interval graphs if G is the class of (unit) interval graphs. Almost (unit) interval graphs are well motivated from computational biology, whe...
متن کاملLinear time recognition of P4-indifference graphs
A P4 is a chordless path of four vertices. A graph is P4-indifference if it admits an ordering < on its vertex set such that every P4 abcd has a < b < c < d or d < c < b < a. Such an ordering is called a P4-indifference ordering. The P4-indifference graphs were introduced in [Chv84] as a particular class of perfectly orderable graphs. A graph is perfectly orderable if there exists an ordering o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00022-0